当前位置:
首页 资源下载
搜索资源 - binary search tree
搜索资源列表
-
0下载:
用二叉查找树对动态查找表的设计与实现,基本操作包括:构造空表、销毁表、搜索指定关键字的元素、插入新元素、删除指定关键字的元素、遍历表中所有元素。-Binary search tree with the dynamic look-up table design and implementation of basic operations including: construction empty table, destroy the table, the search element of th
-
-
0下载:
binary search tree deletion and insert
-
-
0下载:
此源码实现了二叉搜索树的生成及输出排序后的结果-This source code implements a binary search tree generation and output the results sorted
-
-
0下载:
在C++下实现binary search tree的源代码-the source code of realizing binary search tree under C++ environment
-
-
0下载:
二叉搜索树实现的文本文件单词索引表,可将文本中单词按字母顺序列出并且列出每个单词在文本中出现的次数-Binary search tree implementation of the text file the word index table, you can text the word list in alphabetical order and each word in the text are listed in the number of occurrences
-
-
0下载:
平衡二叉树。高效的搜索算法。生成深度最小的二叉搜索树。在大量数据中最快实现搜索。-Balanced binary tree. Efficient search algorithm. Generated the smallest depth binary search tree. Large amounts of data to achieve the fastest in the search.
-
-
0下载:
用C#实现中序线索二叉树的插入、遍历、删除等操作-Threaded Binary Search Tree (C#)
-
-
0下载:
一个简单的二叉搜索树实现,可以直接使用头文件移植-A simple binary search tree implementation can use the header files transplant
-
-
0下载:
使用C++的STL数据结构实验,包括链表、八皇后、扩展洗车仿真、Binary Search Tree的平均树高等问题的实验-Using C++, STL data structure experiments, including lists, eight queens, extended car wash simulation, Binary Search Tree problems as the average tree experiment
-
-
0下载:
二叉搜索树的avl树问题,创建avl树及有关的问题-Binary search tree avl tree problem, create avl trees and related problems
-
-
0下载:
二叉搜索树的初建及有关问题binary search tree -Binary search tree and the problem was first built binary search tree
-
-
0下载:
二叉搜索树中的电路连线问题 Binary search tree -Binary search tree in the circuit connection problems Binary search tree
-
-
1下载:
二叉搜索树中的装箱问题Binary search tr-Binary search tree packing problem Binary search tree
-
-
0下载:
数据结构作业源代码,实现二叉查找树的一些基本功能。-Operation data structure source code, binary search tree to achieve some of the basic functions.
-
-
0下载:
在二叉搜索树上删除一个有两个子女的结点时,可以采用以下三种方法:
(1) 用左子树TL上具有最大关键码的结点X顶替,再递归地删除X。
(2) 交替地用左子树TL上具有最大关键码的结点和右子树TR上具有最小关键码的结点顶替,再递归地删除适当的结点。
(3) 用左子树TL上具有最大关键码的结点或者用右子树TR上具有最小关键码的结点顶替,再递归地删除适当的结点。可随机选择其中一个方案。
试编写程序实现这三个删除方法,并用实例说明哪一个方法最易于达到平衡化。
-In the bin
-
-
0下载:
Binary search Tree implementation.
-
-
0下载:
this c programme describes inorder traversal operation in the binary search tree.
-
-
0下载:
this c programme descripes postorder traversal in binary search tr-this c programme descripes postorder traversal in binary search tree
-
-
0下载:
this c code for preorder traversal in the binary search tr-this c code for preorder traversal in the binary search tree
-
-
0下载:
binary search tree (BST)
-
«
1
2
...
5
6
7
8
9
1011
12
13
14
15
...
34
»